Location:
Search - chess horse
Search list
Description: 用vc实现国际象棋，例如棋盘的设计，马，皇后的走法等等各种操作。-Achieved with the vc chess, such as board design, horse, Queen' s moves and so on all kinds of operations.
Platform: |
Size: 3933184 |
Author: 圣王 |
Hits:
Description: 国际象棋马的遍历 单文档 回到原点 鼠标控制 源代码 运行无误 -Chess horses traverse the document back to square one mouse control the source code to run correct
Platform: |
Size: 2093056 |
Author: seven |
Hits:
Description: 在中国象棋棋盘上，对任一位置上放置的一个马，均能选择一个合适的路线，使得该棋子能按象棋的规则不重复地走过棋盘上的每一个位置。
完成以下功能：
（1）依次输出所走过的各位置的坐标；
（2）最好能画出棋盘的图形形式，并在其上动态的标注行走过程；
（3）程序能方便地移植到其它规格的棋盘上。
-In Chinese chess board, the location of any place on a horse, able to select a suitable route, making the pieces do not follow the rules of chess board repeatedly through every position. Complete the following functions: (1) followed by the output through the coordinates of each location (2) better to draw the board' s graphic form, and in its walk on the dynamic process of labeling (3) program can be easily ported to Other specifications of the board.
Platform: |
Size: 2048 |
Author: 冰与火 |
Hits:
Description: ：将马随机放在国际象棋的8X8棋盘Bo阿rd[0..7,0..7]的某个方格中，马按走棋规则进行移动。
要求每个方格上只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线 ，并按求出的行走路线，
将数字1，2，…，64依次填入8X8的方阵输出之。- The horses were placed in the 8X8 chess board Bo A rd [0 .. 7,0 .. 7] of a box, the horse to move according to the rules for playing chess. Requires that each box is only entered once, traveled all the 64 squares on a chessboard. The preparation of non-recursive program, seeking to run for the routes, according to find the routes for the digital 1,2, ..., 64 in turn fill the square 8X8 output.
Platform: |
Size: 2048 |
Author: Julie |
Hits:
Description: 在半张中国象棋的棋盘上，一只马从左下角到右上角，只允许往右跳，不允许往左跳，问能有多少种跳步方案。
-In half a sheet of Chinese chess chessboard, a horse from lower left to upper right corner, allowing only right and jump, jump to the left is not allowed to ask how many hops to have the program.
Platform: |
Size: 1024 |
Author: 杨梅 |
Hits:
Description: 编写程序求解“骑士巡游”问题：在n行n列的棋盘上（如n=5），假设一位骑士（按国际象棋中“马走日”的行走法）从初始坐标位置(x，y)出发，要遍访（巡游）棋盘中的每一个位置有且仅有一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）。由于n比较大的时候输出结果会很多，以至于运行时间很长，没有实际意义，所以本程序只做了n=5的时候的情况。-Write a program for solving the Knight Parade ": n lines n columns on the board (eg, n = 5), assuming that a knight (chess" horse walk "walking method) from the initial coordinate position (x,y), starting to be visited (parade) board in each position and only once. Please compile a program, and solving for Knight Parade "road map" (or tell the knight, starting from a position can not be visited the whole board- no solution). Since n is relatively large when the output result will be a lot of that running time is very long, has no real meaning, so this procedure only when n = 5.
Platform: |
Size: 1024 |
Author: MK |
Hits:
Description: 自己编写的关于一个马跳日的小游戏，用的是国际象棋的棋盘，有图形界面。-I have written on the day of a horse jumping games, chess board, a graphical interface.
Platform: |
Size: 24576 |
Author: 猫猫大仙 |
Hits:
Description: 将马随机放在国际象棋的8* 8 棋盘Bord[8Ⅱ8]的某个方格中，马按走棋规则进行移动。要求每个方格上只进入一次，走遍棋盘上全部64个方格。
-Grid of the horse were randomly placed in the 8* 8 chess board Bord [8 Ⅱ 8] of a horse by playing chess rules to move it. Requirements on each square only enter once traveled all the 64 squares on the board.
Platform: |
Size: 292864 |
Author: Mr.Wu |
Hits:
Description: 马踏棋盘程序，在8*8的格子中，马（按中国象棋的走法）不重复的将64个点走遍！-Horse Stepping on board procedures, 8* 8 grid, Ma (Chinese chess moves) repeat 64 points all over!
Platform: |
Size: 1024 |
Author: 昊天 |
Hits:
Description: 在西洋棋中的武士（knight）与象棋中的马相似，走的是L型路线，输入一个表示期盼的大小值n，在输入一个起点坐标，找出一条从那一个起点，可以让武士棋走完n*n格而不重复的路径。-Chess samurai (knight) is similar to chess horse, taking the L-shaped route, enter a look forward to the size of the value of n, enter a starting point coordinates, find one from that starting point, you can let the warrior chess finish n* n grid without repeating the path.
Platform: |
Size: 55296 |
Author: 黄文军 |
Hits:
Description: 本程序为delphi下实现n*n的跳马程序。程序里面还实现了动画操作等。为一个高分程序。-The procedures for the Delphi realize n* n the vaulting horse program. Program inside still realize the animation operation, etc. As a high score program.
Platform: |
Size: 185344 |
Author: 纪参 |
Hits:
Description: 马踏棋盘、在文件中分别可选择国际象棋和中国象棋~！-The horse step board、In the file are can choose chess and Chinese chess
Platform: |
Size: 2048 |
Author: 小双 |
Hits:
Description: 根据象棋中马走日规则，规定骑士走的路径，打印骑士走的步数-According to the chess horse day rules require Knight walking the path, print the number of steps to go by the Knight
Platform: |
Size: 2048 |
Author: 小山 |
Hits:
Description: 跳马问题
有一m*n的棋盘（即棋盘由m行和n列），一马放在棋盘中任意位置，马按中国象棋跳法，从初始位置起跳，跳至边界后返回，求所有能返回初始位置的周游路线。-Vault with an m* n chessboard (ie board consisting of m rows and n columns), a horse anywhere on the board, according to Chinese chess horse jump method, from the initial position jump, jump the border and returned, seeking to return all initial position of travel routes.
Platform: |
Size: 15360 |
Author: 佩佩 |
Hits:
Description: 实现马踏棋盘的功能。
输入：马的初始位置。
输出：马踏棋盘的路径。利用贪心算法+回朔算法实现！可以产生全部可能的路径！而且可以可视化的输出动态行走路径！-implementation of the horse working in the chess.
Platform: |
Size: 4096 |
Author: 飞天狐 |
Hits:
Description: 国际象棋棋盘上实现马的遍历（原创），遍历过程有图片显示和路径显示两种方式-Horse on chess board to achieve the ergodic (original), traversal path display a picture display and two ways
Platform: |
Size: 4098048 |
Author: 1 |
Hits:
Description: The horse moves on a chessboard so that the whole house of sacrifice and not refuse any house twice.
be fun.
Platform: |
Size: 1024 |
Author: h191_91448549 |
Hits:
Description: 实现数据结构中的深度遍历算法,自动将国际象棋中的马在棋盘中遍历一遍并能够回到起点,不会走重复的路程-Depth data structure traversal algorithm to automatically chess chessboard horse traversal back to the beginning again and can not walk away from repeating
Platform: |
Size: 2267136 |
Author: zhangying |
Hits:
Description: 马踏棋盘程序，在8*8的格子中，马（按中国象棋的走法）不重复的将64个点走遍！-Horse Stepping on board procedures, 8* 8 grid, Ma (Chinese chess moves) repeat 64 points all over!
Platform: |
Size: 1024 |
Author: ammable |
Hits:
Description: 马步遍历问题
问题描述：有一n×m格的棋盘，按照国际象棋的规划，马只能走“日”字型结构，设计一算法，按马的走法将棋盘每一格刚好遍历一次。-Horse traversal issue
Problem Description: There is an n × m grid of the board, in accordance with the plan of chess, the horse can only take the day shaped structure, design an algorithm, according to the horse and the walk will traverse the chessboard exactly once in each grid.
Platform: |
Size: 1024 |
Author: 陈刚 |
Hits: